Quantum encryption and generalized Shannon impossibility
نویسندگان
چکیده
منابع مشابه
Generalized Quantum Shannon Impossibility for Quantum Encryption
The famous Shannon impossibility result says that any encryption scheme with perfect secrecy requires a secret key at least as long as the message. In this paper we prove its quantum analogue with imperfect secrecy and imperfect correctness. We also provide a systematic study of information-theoretically secure quantum encryption with two secrecy definitions.
متن کاملShannon Impossibility, Revisited
In this note we revisit the famous result of Shannon [Sha49] stating that any encryption scheme with perfect security against computationally unbounded attackers must have a secret key as long as the message. This result motivated the introduction of modern encryption schemes, which are secure only against a computationally bounded attacker, and allow some small (negligible) advantage to such a...
متن کاملGeneral Impossibility of Group Homomorphic Encryption in the Quantum World
Group homomorphic encryption represents one of the most important building blocks in modern cryptography. It forms the basis of widely-used, more sophisticated primitives, such as CCA2-secure encryption or secure multiparty computation. Unfortunately, recent advances in quantum computation show that many of the existing schemes completely break down once quantum computers reach maturity (mainly...
متن کامل2 : Optimality of One - time MACs and Shannon Impossibility
Today we conclude with our study with one-time message authentication codes. In Lecture 1, we defined one-time secure MACs and constructed these MACs using δ − AXU functions. Furthermore, we showed that the security of this construction lost security exponentially with as the min-entropy of the key decreased. We show that the constructions achieved in Lecture 1 were essentially tight. We will d...
متن کاملLecture 2 : Optimality of One - time MACs and Shannon Impossibility
Today we conclude with our study with one-time message authentication codes. In Lecture 1, we defined one-time secure MACs and constructed these MACs using δ − AXU functions. Furthermore, we showed that the security of this construction lost security exponentially with as the min-entropy of the key decreased. We show that the constructions achieved in Lecture 1 were essentially tight. We will d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2019
ISSN: 0925-1022,1573-7586
DOI: 10.1007/s10623-018-00597-3